منابع مشابه
Binary Ant Colony Evolutionary Algorithm
Form the view of the biological viewpoint; each ant of social insects is regarded as neuron. They compose a neural network by stochastic and loose connections with each other; Similar to the artificial neural network simulating the ant colony, the Ant colony algorithm of binary network is presented. As the binary coding is adapted, lower aptitude behave of single ant is requested, less storage ...
متن کاملBinary Ant Colony Evolutionary Algorithm
Every insect is considered, from the viewpoint of biological evolution, to be a neural cell that constitutes a neural network in a casual and loose way of joint. Through simulating the ant swarm intelligence on the basis of human neural network, this paper advances a linear binary network. The binary code expects a low intelligence of each ant, and each path corresponds to a comparatively small...
متن کاملOptimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System
In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...
متن کاملOptimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System
In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...
متن کاملEvolutionary search for low autocorrelated binary sequences
| The search for low autocorrelated binary sequences is a classical example of a discrete frustrated optimization problem. We demonstrate the eeciency of a class of evolutionary algorithms to tackle the problem. A suitable mutation operator using a preselection scheme is constructed and the optimal parameters of the strategy are determined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the International Astronomical Union
سال: 2008
ISSN: 1743-9213,1743-9221
DOI: 10.1017/s1743921308023193